A Linear Constraint Satisfaction Approach toCyclicity 1
نویسنده
چکیده
Abductive reasoning (or explanation) is basically a backward-chaining process on a collection of causal rules. When given an observed event, we attempt to determine the set of causes which brought about this event. Cost-based abduction is a model for abductive reasoning which provides a concrete formulation of the explanation process. However, it restricts itself to acyclic causal knowledge bases. The existence of cyclicity results in anamolous behavior by the model. For example, assume in our knowledge base that A can cause B and B can cause A. When faced with having to explain the occurrence of A, we could postulate B. Now, since A already exists, we can use it the explain B. Our backward-chaining process to nd an explanation can certainly fall into this trap. In this paper, we present a new model called generalized cost-based abduction for general causal knowledge bases. Furthermore, we provide an approach for solving this model by using linear constraint satisfaction. Special thanks to Eugene Charniak for important pointers and critical review of this paper.
منابع مشابه
Hybrid Local Search on Two Multicolouring Models
This paper describes a hybrid local search approach to pure and bandwidth multicolouring problems. It compares two models of multicolouring: a 0/1 integer linear program, and a binary constraint satisfaction model derived by transforming multicolouring problems to colouring problems. The latter approach yields smaller models and competitive results.
متن کاملA Linear Constraint Satisfaction Approach to Cost-Based Abduction
Santos Jr, E., A linear constraint satisfaction approach to cost-based abduction, Artificial Intelligence 65 (1994) 1-27. Abduction is the problem of finding the best explanation for a given set of observations. Within AI, this has been modeled as proving the observation by assuming some set of hypotheses. Cost-based abduction associates a cost with each hypothesis. The best proof is the one wh...
متن کاملFeasible parallel-update distributed MPC for uncertain linear systems sharing convex constraints
A distributed MPC approach for linear uncertain systems sharing convex constraints is presented. The systems, which are dynamically decoupled but share constraints on state and/or inputs, optimize once, in parallel, at each time step and exchange plans with neighbours thereafter. Coupled constraint satisfaction is guaranteed, despite the simultaneous decision making, by extra constraint tighten...
متن کاملRepresentations of the all_different Predicate of Constraint Satisfaction in Integer Programming
The use of predicates to state constraints in Constraint Satisfaction is explained. If, as an alternative, the traditional approach of Integer Programming (IP) is used, it is desirable to model these constraints so as to give as tight a linear programming relaxation as possible. One of the most commonly used predicates is the “all_different” predicate. Different applications of this are describ...
متن کاملSolving finite-domain linear constraints in presence of the $\texttt{alldifferent}$
In this paper, we investigate the possibility of improvement of the widelyused filtering algorithm for the linear constraints in constraint satisfaction problems in the presence of the alldifferent constraints. In many cases, the fact that the variables in a linear constraint are also constrained by some alldifferent constraints may help us to calculate stronger bounds of the variables, leading...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992